fast Möbius transformation
https://gyazo.com/d89b535f29a575dfa6c8a608017267e0
https://arxiv.org/pdf/1304.1122.pdf
O(3^N) when processing the number of subsets for each subset
Why? → Sum of the number of subsets of a subset.
Fast Möbius transformation can make this O(N2^N)
The limit extends from about 16 to 26.
ARC100E
---
This page is auto-translated from /nishio/高速メビウス変換. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I'm very happy to spread my thought to non-Japanese readers.